Completeness of Compositional Translation for Context-Free Grammars
نویسنده
چکیده
A machine translation system is said to be complete if all expressions that are correct according to the source-language grammar can be translated into the target language. This paper addresses the completeness issue for compositional machine translation in general, and for compositional machine translation of context-free grammars in particular. Conditions that guarantee translation completeness of context-free grammars are presented.
منابع مشابه
Categorical Foundations for Extended Compositional Distributional Models of Meaning
Compositional distributional models of meaning were introduced by Coecke et al. (2010, 2013) with the aim of reconciling the theory of distributional meaning in terms of vector space semantics with the theory of compositional interpretation as one finds it in typelogical grammars. The particular typelogical formalisms employed by Coecke et al. (pregroup grammars, Lambek calculus) have a recogni...
متن کاملParsing Non-Recursive Context-Free Grammars
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show th...
متن کاملOn the Computational Complexity of Synchronized Context-Free Languages
We introduce counter synchronized context-free grammars and investigate their generative power. It turns out that the family of counter synchronized context-free languages is a proper superset of the family of context-free languages and is strictly contained in the family of synchronized context-free languages. Moreover, we establish the space and time complexity of the fixed membership, the ge...
متن کاملAdaptor Grammars: A Framework for Specifying Compositional Nonparametric Bayesian Models
This paper introduces adaptor grammars, a class of probabilistic models of language that generalize probabilistic context-free grammars (PCFGs). Adaptor grammars augment the probabilistic rules of PCFGs with “adaptors” that can induce dependencies among successive uses. With a particular choice of adaptor, based on the Pitman-Yor process, nonparametric Bayesian models of language using Dirichle...
متن کاملModularized Context-Free Grammars
Given two context-free grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 G 2) 6 = L(G 1) L(G 2). In order to account for mod-ularity of grammars, another way of deening the meaning of grammars is needed. This paper adapts results from the semantics of logic programming languages to CFGs. We discu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cmp-lg/9607035 شماره
صفحات -
تاریخ انتشار 1996